Generalized Binet dynamics
نویسندگان
چکیده
The Binet formula provides a mechanism for the Fibonacci numbers to be viewed as a function of a complex variable. The Binet formula may be generalized by using other bases and multiplicative parameters that also give functions of a complex variable. Thus, filled-in Julia sets that exhibit escape time may be constructed. Moreover, these functions have computable critical points and hence we can create escape time images of the critical point based upon the underlying multiplicative parameter. Like the classic Mandelbrot set, these parameter space images give a type of atlas into the Julia sets.
منابع مشابه
A Simplified Binet Formula for k-Generalized Fibonacci Numbers
In this paper, we present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc.). Furthermore, we show that in fact one needs only take the integer closest to the first term of this Binet-style formula in order to generate the desired sequence.
متن کاملThe Binet formula, sums and representations of generalized Fibonacci p-numbers
In this paper, we consider the generalized Fibonacci p-numbers and then we give the generalized Binet formula, sums, combinatorial representations and generating function of the generalized Fibonacci p-numbers. Also, using matrix methods, we derive an explicit formula for the sums of the generalized Fibonacci p-numbers. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملTHE GENERALIZED BINET FORMULA, REPRESENTATION AND SUMS OF THE GENERALIZED ORDER-k PELL NUMBERS
In this paper we give a new generalization of the Pell numbers in matrix representation. Also we extend the matrix representation and we show that the sums of the generalized order-k Pell numbers could be derived directly using this representation. Further we present some identities, the generalized Binet formula and combinatorial representation of the generalized order-k Pell numbers.
متن کاملOptimization with binet matrices
This paper deals with linear and integer programming problems in which the constraint matrix is a binet matrix. Binet matrices are pivoted versions of the node-edge incidence matrices of bidirected graphs. It is shown that efficient methods are available to solve such optimization problems. Linear programs can be solved with the generalized network simplex method, while integer programs are con...
متن کاملON THE GENERALIZED ORDER-k FIBONACCI AND LUCAS NUMBERS
In this paper we consider the generalized order-k Fibonacci and Lucas numbers. We give the generalized Binet formula, combinatorial representation and some relations involving the generalized order-k Fibonacci and Lucas numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 31 شماره
صفحات -
تاریخ انتشار 2007